A fast matrix-vector multiplication method for solving the radiosity equation
نویسندگان
چکیده
A “fast matrix–vector multiplication method” is proposed for iteratively solving discretizations of the radiosity equation (I −K)u = E. The method is illustrated by applying it to a discretization based on the centroid collocation method. A convergence analysis is given for this discretization, yielding a discretized linear system (I − Kn)un = En. The main contribution of the paper is the presentation of a fast method for evaluating multiplications Knv, avoiding the need to evaluate Kn explicitly and using fewer than O(n) operations. A detailed numerical example concludes the paper, and it illustrates that there is a large speedup when compared to a direct approach to discretization and solution of the radiosity equation. The paper is restricted to the surface S being unoccluded, a restriction to be removed in a later paper.
منابع مشابه
A Fast and Accurate Expansion-Iterative Method for Solving Second Kind Volterra Integral Equations
This article proposes a fast and accurate expansion-iterative method for solving second kind linear Volterra integral equations. The method is based on a special representation of vector forms of triangular functions (TFs) and their operational matrix of integration. By using this approach, solving the integral equation reduces to solve a recurrence relation. The approximate solution of integra...
متن کاملA Fast Solver of Radiosity Equation Systems 1
In this paper, we explore the properties of radiosity equation systems and analyze the mathematical background of existing O(n) solvers for such systems. Based on our analysis, we present a new algorithm using an inverse matrix approximation technique along with an improvement in the existing algorithm due to Feda 2]. We prove the convergence of our method, as well as the modiied version of Fed...
متن کاملA Fast Parallel Krylov Subspace Method for the Radiosity Equation
In computer graphics, the radiosity equation plays an important in obtaining realistic illumination. The size of the system generated when solving the radiosity equation can have very large order and consequently, the cost of solving this system can be quite large, both in computing time and memory. In this paper, we investigate the applicability and performance of some Krylov subspace methods ...
متن کاملMultilevel Fast Multipole Algorithmfor Solving Combined Field
The fast multipole method (FMM) has been implemented to speed up the matrix-vector multiply when an iterative method is used to solve combined eld integral equation (CFIE). FMM reduces the complexity from O(N 2) to O(N 1:5). With a multilevel fast multipole algorithm (MLFMA), it is further reduced to O(NlogN). A 110,592 unknown problem can be solved within 24 hours on a SUN Sparc10.
متن کاملFast Finite Element Method Using Multi-Step Mesh Process
This paper introduces a new method for accelerating current sluggish FEM and improving memory demand in FEM problems with high node resolution or bulky structures. Like most of the numerical methods, FEM results to a matrix equation which normally has huge dimension. Breaking the main matrix equation into several smaller size matrices, the solving procedure can be accelerated. For implementing ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- Adv. Comput. Math.
دوره 12 شماره
صفحات -
تاریخ انتشار 2000